Random Geometric Graph Diameter in the Unit Ball
نویسندگان
چکیده
منابع مشابه
Random Geometric Graph Diameter in the Unit
Let n be a positive integer, and λ > 0 a real number. Let Vn be a set of n points randomly located within the unit disk, which are mutually independent. For 1 ≤ p ≤ ∞, define Gp(λ, n) to be the graph with the vertex set Vn, in which two vertices are adjacent if and only if their `p-distance is at most λ. We call this graph a unit disk random graph. Let λ = c √ ln n/n and let X be the number of ...
متن کاملCovering Random Points in a Unit Ball
Choose random pointsX1, X2, X3, . . . independently from a uniform distribution in a unit ball in <. Call Xn a dominator iff distance(Xn, Xi) ≤ 1 for all i < n, i.e. the first n points are all contained in the unit ball that is centered at the n’th point Xn. We prove that, with probability one, only finitely many of the points are dominators. For the special casem = 2, we consider the unit disk...
متن کاملHamiltonicity of the random geometric graph
Let X1, . . . , Xn be independent, uniformly random points from [0, 1] . We prove that if we add edges between these points one by one by order of increasing edge length then, with probability tending to 1 as the number of points n tends to ∞, the resulting graph gets its first Hamilton cycle at exactly the same time it loses its last vertex of degree less than two. This answers an open questio...
متن کاملOn the Connectedness and Diameter of a Geometric Johnson Graph
Let P be a set of n points in general position in the plane. A subset I of P is called an island if there exists a convex set C such that I = P ∩C. In this paper we define the generalized island Johnson graph of P as the graph whose vertex consists of all islands of P of cardinality k, two of which are adjacent if their intersection consists of exactly l elements. We show that for large enough ...
متن کاملThe Steiner diameter of a graph
The Steiner distance of a graph, introduced by Chartrand, Oellermann, Tian and Zou in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ and $Ssubseteq V(G)$, the Steiner distance $d(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. Let $...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2007
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-006-0172-y